Pairwise Learning with Differential Privacy Guarantees
نویسندگان
چکیده
منابع مشابه
Toward sensitive document release with privacy guarantees
Privacy has become a serious concern for modern Information Societies. The sensitive nature of much of the data that are daily exchanged or released to untrusted parties requires that responsible organizations undertake appropriate privacy protection measures. Nowadays, much of these data are texts (e.g., emails, messages posted in social media, healthcare outcomes, etc.) that, because of their...
متن کاملCoordinating Logistics Operations with Privacy Guarantees
Several logistics service providers serve a certain number of customers, geographically spread over an area of operations. They would like to coordinate their operations so as to minimize overall cost. At the same time, they would like to keep information about their costs, constraints and preferences private, thus precluding conventional negotiation. We show how AI techniques, in particular Di...
متن کاملAdCSP — Cooperative Ad Auctions with Privacy Guarantees
This paper discusses a cooperative model for advertisement bidding with privacy guarantees. In our application, a set of participants need to agree on an allocation of advertisements to be shown on an Internet stream. The participants have preferences that pose constraints to what should be streamed, and define the value of the ads. Streaming an ad to a specific audience yields larger value tha...
متن کاملPrivacy-Enhanced and Multifunctional Health Data Aggregation under Differential Privacy Guarantees
With the rapid growth of the health data scale, the limited storage and computation resources of wireless body area sensor networks (WBANs) is becoming a barrier to their development. Therefore, outsourcing the encrypted health data to the cloud has been an appealing strategy. However, date aggregation will become difficult. Some recently-proposed schemes try to address this problem. However, t...
متن کاملSelective Sampling with Almost Optimal Guarantees for Learning to Rank from Pairwise Preferences
One of the practical obstacles of learning to rank from pairwise preference labels is in its (apparent) quadric sample complexity. Some heuristics have been tested for overriding this obstacle. In this workshop we will present new provable method for reducing this sample-complexity, almost reaching the informational lower bound, while suffering only negligible sacrifice of optimality. Our main ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i01.5411